-
-
Notifications
You must be signed in to change notification settings - Fork 100
Add OBST algorithm implementation in C++ #238
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
Implement Optimal Binary Search Tree algorithm.
Reviewer's guide (collapsed on small PRs)Reviewer's GuideThis PR adds a C++ implementation of the optimal binary search tree algorithm, using dynamic programming to compute minimal search costs and reconstruct the tree structure from computed root indices. File-Level Changes
Tips and commandsInteracting with Sourcery
Customizing Your ExperienceAccess your dashboard to:
Getting Help
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for raising the PR, the owner will be review it soon' keep patience, keep contributing>>>!!! make sure you have star ⭐ the repo
|
@Praneel-Shivarkar raise an ISSUE as well regarding the problem |
|
@SjxSubham can you please merge this? |
|
@Praneel-Shivarkar no need to be hurry...make these changes
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
change file name ...
rename the file name as ProblemNo. PRoblem Name.cpp
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@Praneel-Shivarkar after this above changes I'll merge ur PR
Problem Statement: Given sequence k = k1 <k2 < … <kn of n sorted keys, with a search probability pi for each key ki . Build the Binary search tree that has the least search cost given the access probability for each key?
Summary by Sourcery
New Features: